Synthesis of deterministic top-down tree transducers from automatic tree relations
نویسندگان
چکیده
منابع مشابه
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations
We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees. We consider the case of specifications that are deterministic top-down tree automatic, meaning the specification is recognizable by a deterministic top-down tree automaton that reads the two given trees synchronously in parallel. In this setting we s...
متن کاملUniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers
For a given binary relation of finite trees, we consider the synthesis problem of deciding whether there is a deterministic top-down tree transducer that uniformizes the relation, and constructing such a transducer if it exists. A uniformization of a relation is a function that is contained in the relation and has the same domain as the relation. It is known that this problem is decidable if th...
متن کاملNode Query Preservation for Deterministic Linear Top-Down Tree Transducers
This paper discusses the decidability of node query preservation problems for XML document transformations. We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLTV ) and an n-ary query based on runs of a tree automaton. We say that a DLTV Tr strongly preserves a query Q if there is a query Q′ such that for every document t, the answer set of...
متن کاملDeterministic Top-Down Tree Transducers with Iterated Lookahead
It is known that by iterating the look-ahead tree languages for deterministic topdown tree automata, more and more powerful recognizing devices are obtained. Let DR0 = DR, where DR is the class of all tree languages recognizable by deterministic top-down tree automata, and let, for n 1, DRn be the class of all tree languages recognizable by deterministic top-down tree automata with DRn 1 lookah...
متن کاملCompositions of Extended Top-down Tree Transducers
Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular loo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2016.07.013